All Questions
1 question
4votes
1answer
3kviews
Finding the longest path, avoiding obstacles in a 2D plane
The Scenario You are given a matrix of size m x n (width x height) with m*n spots where there are a few obstacles. Spots with obstacles are marked as 1, and those without are marked as 0. You can ...
